Cycle Crossover for Permutations with Repetitions Application to Graph Partitioning Technical Report CSM-454
نویسندگان
چکیده
Geometric crossover is a representation-independent generalisation of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation. In previous work, we have applied geometric crossover to simple permutations. In this paper, we design a new geometric crossover for permutations with repetitions that naturally suits partition problems and test it on the graph partitioning problem. Our new crossover outperforms all previous ones.
منابع مشابه
Geometric Crossover for Permutations with Repetitions: Applications to Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation. In previous work we have applied geometric crossover to simple permutations. In t...
متن کاملGeometric Crossovers for Multiway Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as a basis for geometric crossover, one can design new crossovers for any representation. Using a distance tailored to the problem at hand, the formal definition of geom...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملArchitectural Enhancements for Fast Subword Permutations with Repetitions in Cryptographic Applications
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permutations with repetitions are rearrangements of an ordered set in which elements may replace other elements in the set; such permutations are useful in cryptographic algorithms. On a 4-way superscalar processor, an arbit...
متن کاملA new crossover sine model based on trigonometric model and its application to the crossover lattice equation of state.
In this study, a new crossover sine model (CSM) n was developed from a trigonometric model [M. E. Fisher, S. Zinn, and P. J. Upton, Phys. Rev. B 59, 14533 (1999)]. The trigonometric model is a parametric formulation model that is used to represent the thermodynamic variables near a critical point. Although there are other crossover models based on this trigonometric model, such as the CSM and t...
متن کامل